A System Dependence Net Generator for Ada Programs
نویسندگان
چکیده
An explicit representation of various dependence relationship in a program has many application in software engineering. System Dependence Net is a model to represent program dependences in a concurrent program which consists of multiple procedures. This paper presents how to generate System Dependence Net for Ada 95 programs automatically.
منابع مشابه
A Task Dependence Net Generator for Concurrent Ada Programs
There are ve types of basic program dependences in concurrent programs. Task Dependence Net(TDN) is an arc-classi ed digraph to explicitly represent the ve types of basic program dependences in concurrent Ada programs. This paper describes algorithms to compute TDNs for a class of concurrent Ada programs, and shows the structure and implementation of our TDN generator for concurrent Ada program...
متن کاملAutomatic Translation of Ada-ECATNet Using Rewriting Logic
One major difficulty that faces developers of concurrent and distributed software is analysis for concurrency based faults like deadlocks. Petri nets are used extensively in the verification of correctness of concurrent programs. ECATNets are a category of algebraic Petri nets based on a sound combination of algebraic abstract types and high-level Petri nets. ECATNets have 'sound' and 'complete...
متن کاملARTK-M2: a Kernel for Ada Tasking Requirements: an Implementation and an Automatic Generator
A run-time kernel, ARTK-M2, supporting Ada tasking semantics is discussed; full support for task creation, synchronization, communication, scheduling, and termination is provided, together with all options of the Ada rendezvous. An implementation in Modula-2 is presented and a method for automatically translating Ada programs into semantically equivalent Modula-2 programs with corresponding ker...
متن کاملDouble Reduction of Ada-ECATNet Representation using Rewriting Logic
One major difficulty that faces developers of concurrent and distributed software is analysis for concurrency based faults like deadlocks. Petri nets are used extensively in the verification of correctness of concurrent programs. ECATNets [2] are a category of algebraic Petri nets based on a sound combination of algebraic abstract types and high-level Petri nets. ECATNets have 'sound' and 'comp...
متن کاملVerification in Concurrent Programming with Petri Nets Structural Techniques
This paper deals with verification of flow control in concurrent programs. We use Ada language model as reference. After translation of Ada programs into Petri nets (named Ada nets for Ada programs), we show how one can fully exploit the relationship between the behavior of the concurrent program and the structure of the corresponding Petri net. Using the siphon structure, we precise some struc...
متن کامل